Welcome![Sign In][Sign Up]
Location:
Search - linear programming steepest

Search list

[Other resourcematlog

Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: | Size: 4853791 | Author: 陈宝文 | Hits:

[Other resourcelinearsolvers

Description: matlab编程的三个线性方程组求解子程序:cggm.m,fdm.m,febs.m.其中cggm.m为共轭梯度法求解子程序,fdm.m为最速下降法求解自程序,febs.m为三对角追赶法求解子程序.-Matlab programming three linear equations subroutine : cggm.m, fdm.m. febs.m. which cggm.m to conjugate gradient method subroutine, fdm.m for the steepest decline since the method procedures febs.m angle to catch up with three pairs method subroutine.
Platform: | Size: 1578 | Author: 王礼广 | Hits:

[matlabmatlog

Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: | Size: 4853760 | Author: 陈宝文 | Hits:

[matlablinearsolvers

Description: matlab编程的三个线性方程组求解子程序:cggm.m,fdm.m,febs.m.其中cggm.m为共轭梯度法求解子程序,fdm.m为最速下降法求解自程序,febs.m为三对角追赶法求解子程序.-Matlab programming three linear equations subroutine : cggm.m, fdm.m. febs.m. which cggm.m to conjugate gradient method subroutine, fdm.m for the steepest decline since the method procedures febs.m angle to catch up with three pairs method subroutine.
Platform: | Size: 1024 | Author: 王礼广 | Hits:

[matlabfsx

Description: 非线性规划中的最速下降法,黄金分割法,阻尼牛顿法,牛顿切线法.-Non-linear programming in the steepest descent method, golden section method, damping Newton s Law, Newton s tangent method.
Platform: | Size: 2048 | Author: | Hits:

[matlabsteep

Description: 用MATLAB实现非线性规划中的最速梯度法,并有GUI图形-MATLAB realization of non-linear programming used in the steepest gradient method, and graphical GUI
Platform: | Size: 1024 | Author: 段斌 | Hits:

[matlabNonlinear_Programming

Description: 非线性规划中的最陡下降法、BFGS方法和共轭梯度法matlab源程序(3-拟牛顿BFGS方法).m-Non-linear programming in the steepest descent method, BFGS and conjugate gradient method matlab source code (3- Quasi-Newton BFGS method). M
Platform: | Size: 1024 | Author: lilin | Hits:

[matlabMATLABoptimization

Description: matlab最优化程序包括 无约束一维极值问题 进退法 黄金分割法 斐波那契法 牛顿法基本牛顿法 全局牛顿法 割线法 抛物线法 三次插值法 可接受搜索法 Goidstein法 Wolfe.Powell法 单纯形搜索法 Powell法 最速下降法 共轭梯度法 牛顿法 修正牛顿法 拟牛顿法 信赖域法 显式最速下降法, Rosen梯度投影法 罚函数法 外点罚函数法 內点罚函数法 混合罚函数法 乘子法 G-N法 修正G-N法 L-M法 线性规划 单纯形法 修正单纯形法 大M法 变量有界单纯形法 整数规划 割平面法 分支定界法 0-1规划 二次规划 拉格朗曰法 起作用集算法 路径跟踪法 粒子群优化算法 基本粒子群算法 带压缩因子的粒子群算法 权重改进的粒子群算法 线性递减权重法 自适应权重法 随机权重法 变学习因子的粒子群算法 同步变化的学习因子 异步变化的学习因子 二阶粒子群算法 二阶振荡粒子群算法 -matlab optimization process includes Non-binding one-dimensional extremum problems Advance and retreat method Golden Section Fibonacci method of basic Newton s method Newton s method Newton s Law of the global secant method parabola method acceptable to the three interpolation search method   Goidstein France Wolfe.Powell France Simplex search method Powell steepest descent method Conjugate gradient method Newton s method Newton s method to amend Quasi-Newton Method trust region method explicitly steepest descent method, Rosen gradient projection method Penalty function method outside the penalty function method within the penalty function method Mixed penalty function multiplier method   G-N was amended in G-N method L-M method Of linear programming simplex method, revised simplex method Big M method variables bounded simplex method, Cutting Plane Method integer programming branch and bound method 0-1 programming quadratic programming
Platform: | Size: 38912 | Author: 百位过 | Hits:

[matlabOptimization-method

Description: 最优化方法及其Matlab程序设计,乘子法程序,非线性最小二乘问题源码,最速下降法与牛顿法源码-Optimization method and Matlab programming, multiplier method procedures, non-linear least squares problem source, the steepest descent method and Newton' s law code, etc.
Platform: | Size: 34816 | Author: 郝梦 | Hits:

[Othersteepdescent

Description: 无约束线性规划的一种求解方法,最速下降法。程序简单,容易使用。-A constrained linear programming method for solving the steepest descent method. The program is simple, easy to use.
Platform: | Size: 1024 | Author: sss | Hits:

[Special Effectsgradient_descent

Description: 非线性规划,无约束优化问题的解法,最速下降法,材料以及源码-Linear programming, unconstrained optimization problem solution, the steepest descent method, materials and source
Platform: | Size: 768000 | Author: kamy | Hits:

[OtherMATLAB

Description: 本书系统的介绍了非线性优化的理论与方法及其matlab程序设计,本书的主要内容包括:最速下降法与牛顿法;共轭梯度法;拟牛顿法;信赖域法;线性最小二乘问题的解法;序列二次规划法;以及matlab最有工具。 -This book introduces the system of nonlinear optimization theory and methods and matlab programming, the main contents of this book include: the steepest descent method and Newton method conjugate gradient method quasi-Newton method trust region method linear least squares Problem Solution sequential quadratic programming and most matlab tool.
Platform: | Size: 1895424 | Author: 明康中锦 | Hits:

[Mathimatics-Numerical algorithmsMATLAB-FOR-ALGORITH

Description: 非线性最优化问题的基本理论和算法程序,主要包括:线性搜索技术,牛顿法,最速下降法,序列二次规划等算法。-The basic theory and nonlinear optimization algorithm procedural issues, including: linear search, Newton s method, the steepest descent method, sequential quadratic programming algorithm.
Platform: | Size: 5020672 | Author: LIAO Wei-ping | Hits:

[Otherguangpan

Description: Rosen梯度投影法 罚函数法 外点罚函数法 內点罚函数法 混合罚函数法 乘子法 G-N法 修正G-N法 L-M法 线性规划 单纯形法 修正单纯形法 大M法 变量有界单纯形法 整数规划 割平面法 分支定界法 0-1规划 二次规划 拉格朗曰法 起作用集算法 路径跟踪法 粒子群优化算法 基本粒子群算法 带压缩因子的粒子群算法 权重改进的粒子群算法 线性递减权重法 自适应权重法 随机权重法 变学习因子的粒子群算法 同步变化的学习因子 异步变化的学习因子 二阶粒子群算法 二阶振荡粒子群算法-radient method Newton s method Newton s method to amend Quasi-Newton Method trust region method explicitly steepest descent method, Rosen gradient projection method Penalty function method outside the penalty function method within the penalty function method Mixed penalty function multiplier method G-N was amended in G-N method L-M method Of linear programming simplex method, revised simplex method Big M method variables bounded simplex method, Cutting Plane Method integer programming branch and bound method 0-1 programming quadratic programming
Platform: | Size: 47104 | Author: 我去 | Hits:

[Algorithmsd_final

Description: 最优化方法问题,通过最速下降法求数学方面的线性规划问题。利用C编程实现-Optimization method problem solving linear programming math by the steepest descent method. The use of C Programming
Platform: | Size: 1024 | Author: guo | Hits:

[Other智能优化算法资料

Description: 优化算法有很多,经典算法包括:有线性规划,动态规划等;改进型局部搜索算法包括爬山法,最速下降法等,模拟退火、遗传算法以及禁忌搜索称作指导性搜索法。而神经网络,混沌搜索则属于系统动态演化方法。 梯度为基础的传统优化算法具有较高的计算效率、较强的可靠性、比较成熟等优点,是一类最重要的、应用最广泛的优化算法。但是,传统的最优化方法在应用于复杂、困难的优化问题时有较大的局限性。(There are many optimization algorithms, the classical algorithms include linear programming, dynamic programming, etc. the improved local search algorithms include hill-climbing method, steepest descent method, etc. simulated annealing, genetic algorithm and tabu search are called the guiding search methods. The neural network and chaotic search belong to the dynamic evolution method of the system. Gradient based traditional optimization algorithm has the advantages of high computational efficiency, strong reliability and relatively mature. It is one of the most important and most widely used optimization algorithms. However, the traditional optimization method has great limitations when it is applied to complex and difficult optimization problems.)
Platform: | Size: 1857536 | Author: 韬文 | Hits:

CodeBus www.codebus.net